Approximation Algorithms for the Dubins' Traveling Salesman Problem
نویسنده
چکیده
We present an approximation algorithm for the traveling salesman problem when the vehicle is constrained to move forward along paths with bounded curvatures (Dubins’ vehicle). A deterministic algorithm returns in time O(n3) a tour within (( 1 + max { 8πρ Dmin , 14 3 }) log n ) of the optimum tour, where n is the number of points to visit, ρ is the minimum turn radius and Dmin is the minimum Euclidean distance between any two points. A randomized version returns a tour with an expected approximation ratio of (( 1 + 13.58ρ Dmin ) log n ) . This very simple algorithm reduces the Dubins traveling salesman problem to an asymmetric traveling salesman problem on a directed graph.
منابع مشابه
An Approximation Algorithm for the Curvature-Constrained Traveling Salesman Problem
We present an approximation algorithm for the Traveling Salesman Problem when the vehicle is constrained to move forward along paths with bounded curvature (Dubins’ vehicle). A deterministic algorithm returns in time O(n3) a tour within (( 1 + max { 8πρ Dmin , 14 3 }) log n ) of the optimum tour, where n is the number of points to visit, ρ is the minimum turning radius and Dmin is the minimum E...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملDubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach
We study the problem of finding the minimum-length curvature constrained closed path through a set of regions in the plane. This problem is referred to as the Dubins Traveling Salesperson Problem with Neighborhoods (DTSPN). An algorithm is presented that uses sampling to cast this infinite dimensional combinatorial optimization problem as a Generalized Traveling Salesperson Problem (GTSP) with ...
متن کاملAsymptotic constant-factor approximation algorithm for the Traveling Salesperson Problem for Dubins' vehicle
This article proposes the first known algorithm that achieves a constant-factor approximation of the minimum length tour for a Dubins’ vehicle through n points on the plane. By Dubins’ vehicle, we mean a vehicle constrained to move at constant speed along paths with bounded curvature without reversing direction. For this version of the classic Traveling Salesperson Problem, our algorithm closes...
متن کاملSolving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کامل